Choosing a Combinatorial Auction Design: An Illustrated Example
نویسنده
چکیده
This paper summarizes a talk given in honor of Saul Gass’ 80 Birthday celebration. The paper is modeled after Saul’s well-known book An Illustrated Guide to Linear Programming and presents some of the illustrations provided during that talk. In this paper, we explain why specific rules might be chosen within a general combinatorial auction framework. The purpose of such rules is to assure that the market mechanism is fair to both buyers and sellers and so that the auction will end in an efficient outcome, i.e. the goods are won by those that value them the most. The paper describes some of the issues, both computational and economic, that one faces when designing such auctions.
منابع مشابه
Selecting Efficient Service-providers in Electric Power Distribution Industry Using Combinatorial Reverse Auction
In this paper, a combinatorial reverse auction mechanism is proposed for selecting the most efficient service-providers for resolving sustained power interruptions in multiple regions of an electric power distribution company’s responsibility area. Through this mechanism, supplying the required service in each region is assigned to only one potential service-provider considering two criteria in...
متن کاملAn Agent Based Market Design Methodology for Combinatorial Auctions
Auction mechanisms have attracted a great deal of interest and have been used in diverse emarketplaces. In particular, combinatorial auctions have the potential to play an important role in electronic transactions. Therefore, diverse combinatorial auction market types have been proposed to satisfy market needs. These combinatorial auction types have diverse market characteristics, which require...
متن کاملLecture 10 4 Combinatorial Auctions 4.1 Vickrey Auction
In this section, we present a few examples from the area of mechanism design. The fundamental questions that one attempts to address in mechanism design is the following: Assuming that players act strategically, how should we design the rules of the game such that the players’ strategic behavior leads to a certain desirable outcome of the game? As a motivating example, we first consider one of ...
متن کاملStability and Incentive Compatibility in a Kernel-Based Combinatorial Auction
We present the design and analysis of an approximately incentive-compatible combinatorial auction. In just a single run, the auction is able to extract enough value information from bidders to compute approximate truth-inducing payments. This stands in contrast to current auction designs that need to repeat the allocation computation as many times as there are bidders to achieve incentive compa...
متن کاملWinner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006